package leetcode.D400.T323;

import util.GraphUtil;

/**
 * @File Info: leetcode -- <M323>
 * @Author: 18362
 * @Create: 2022-03-18 22:33:36 星期五
 */
public class M323 {
    public static void main(String[] args) {
        int n = 5;
        int[][] edges = GraphUtil.parseGraph("[[0,1],[1,2],[3,4]]");
        System.out.println(new Solution().countComponents(n, edges));
    }
}
